/*
 +-----------------------------------------------------------------------------------------------+
 | Project : UKAPI
 +-----------------------------------------------------------------------------------------------+
 | Project Description : Universal & Kernel API
 +-----------------------------------------------------------------------------------------------+
 | File Description :
 |   Graph
 |                                                 
 +-----------------------------------------------------------------------------------------------+
 | Licence : MIT Licence
 +-----------------------------------------------------------------------------------------------+
 | Copyright (c) 2006 Olivier Vanhoucke
 | 
 | Permission is hereby granted, free of charge, to any person obtaining a copy of this software 
 | and associated documentation files (the "Software"), to deal in the Software without 
 | restriction, including without limitation the rights to use, copy, modify, merge, publish, 
 | distribute, sublicense, and/or sell copies of the Software, and to permit persons to whom the 
 | Software is furnished to do so, subject to the following conditions:
 | 
 | The above copyright notice and this permission notice shall be included in all copies or 
 | substantial portions of the Software.
 | 
 | THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR IMPLIED, INCLUDING
 | BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND 
 | NONINFRINGEMENT. IN NO EVENT SHALL THE AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, 
 | DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM, 
 | OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE SOFTWARE.
 +-----------------------------------------------------------------------------------------------+
*/

/**
 * Inclusions standards
 */
#include <ukapi.h>

/**
 * Inclusions locales
 */
#include <graph.h>

int graph_insert_edge( pgraph_t graph, const pointer_t data1, const pointer_t data2 )
{
	plist_node_t				element = null;
	register unsigned int		val_ret = 0;

	/* Interdit l'insertion d'un arc sans ses deux sommets dans le graphe. */
	for ( element = list_head( &graph->adjacent_list ); element != null; element = list_next( element ) ) 
	{
		if ( graph->corresp( data2, ( (padjacent_list_t) list_data( element ) )->sommet ) )
		{
			break;
		}
	}

	if ( element == null )
	{
		return -1;
	}

	for ( element = list_head( &graph->adjacent_list ); element != null; element = list_next( element ) ) 
	{
		if ( graph->corresp( data1, ( (padjacent_list_t) list_data( element ) )->sommet ) )
		{
			break;
		}
	}

	if ( element == null )
	{
		return -1;
	}

	/* Insertion du second sommet dans la list d'adjacence du premier. */
	if ( ( val_ret = set_insert( &( (padjacent_list_t) list_data( element ) )->adjacent, data2 ) ) != 0 )
	{
		return val_ret;
	}

	/* Ajuste le nombre d'arcs pour prendre en compte l'insertion. */
	graph->nb_a++;

	return 0;
}
